A further note on top-down deterministic languages
نویسندگان
چکیده
منابع مشابه
Top-down Deterministic Languages
Two new families of languages, the F(k) and U(k) languages, are Introduced each of which is, in some sense, a generalization of top-down deterministic languages. This leads us to new characterizations of s-grammars and LL(1) languages. We include a characterization of the unambiguous context-free languages, generalizations of the equivalence relation on s-grammars to LL(k) grammars, and a summa...
متن کاملContribution to deterministic top-down analysis of context-free languages
In the present paper a generalization of ZX(A:)-grammars is given, the notion of the switching function for such grammars is introduced and the model of the Parsing Machine using the switch ing function is given. We introduce the necessary notions and notation, mainly according to D. E. Knuth: An alphabet X is a finite nonempty set of symbols, and X* denotes the set of all strings on the alpha...
متن کاملA Note on a Decomposition Theorem for Simple Deterministic Languages
The simple deterministic grammar (s-grammar) is the standard form grammar in which the handles of the Z-rules are distinct for each nonterminal symbol Z. The language generated by an s-grammar is called the simple deterministic language (s-language). It is known that the s-languages have the the prefix property and that their equivalence problem is solvable. (Korenjak and Hopcroft, 1966). Using...
متن کاملA Note on the Succinctness of Descriptions of Deterministic Languages
The result proved in this paper is that for the elements of some infinite class of deterministic context-free languages the size of deterministic pushdown amomata needed to describe them is not recursively bounded by the size of the smallest unambiguous context-free grammars that generate them. This is a quantitative explanation of the fact that some languages require large descriptions in term...
متن کاملTop-Down Parsing of Conjunctive Languages
This paper generalizes the notion of a strong LL(k) context-free grammar for the case of conjunctive grammars and develops a top-down parsing algorithm for the resulting language family. A top-down parser of a conjunctive language attempts to construct a derivation of the input string, at each step using a nite lookahead to determine which grammar rule to apply. Fragments of formulae that form ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Computer Journal
سال: 1971
ISSN: 0010-4620,1460-2067
DOI: 10.1093/comjnl/14.4.396